The Structure of Tractable Constraint Satisfaction Problems
نویسنده
چکیده
We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.
منابع مشابه
Characterising Tractable Constraints
Finding solutions to a binary constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. This paper considers restricted sets of contraints which are closed under permutation of the labels. We identify a set of constraints which gives rise to a class of tractabl...
متن کاملHybrid Tractable Classes of Constraint Problems
We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based. 1998 ACM Subject Classification F.4.1 Mathematical Logic, G.2.1 Combinatorics, G.2.2 Graph Theory, F.1.3 Complexity Measures and Classes, ...
متن کاملTractable Disjunctive Constraints
Many combinatorial search problems can be expressed as `constraint satisfaction problems', and this class of problems is known to be NP-complete in general. In this paper we investigatèdisjunctive constraints', that is, constraints which have the form of the disjunc-tion of two constraints of speciied types. We show that when the constraint types involved in the disjunction have a certain prope...
متن کاملTractable Constraints on Ordered Domains
Finding solutions to a constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. In this paper we identify a restricted set of contraints which gives rise to a class of tractable problems. This class generalizes the notion of a Horn formula in propositional log...
متن کاملPhase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference
Identifying tractable subclasses and design ing efficient algorithms for these tractable classes are important topics in the study of constraint satisfaction and Bayesian network inference problems. In this paper we inves tigate the asymptotic average behavior of a typical tractable subclass characterized by the treewidth of the problems. We show that the property of having a bounded treewidt...
متن کامل